A Decomposition Procedure for the Analysis of a Closed Fork/Join Queueing System

.-\.0. iterative approximation algorithm for analyzing a closed queueing system with a K-sibling fork/ join queue is presented. The iterative procedure is based on a combination of nearly complete decomposability and the Gauss-Seidel method. The approximation procedure gives good results for the mean response time and the system throughput. However, it gives results which are an upper bound of the mean response time of the fork/join operation and a lower bound of the system throughput, for both homogeneous and non-homogeneous cases. Furthermore. the iterative procedure converges to the exact solution in the case of the closed 3sibling fork/join queue.